Designing a Practical Code-Based Signature Scheme from Zero-Knowledge Proofs with Trusted Setup

This paper defines a new practical construction for code-based signature scheme. We introduce protocol that is designed to follow the recent paradigm known as “Sigma with helper”, and prove protocol’s security reduces directly Syndrome Decoding Problem. The then converted full-fledged scheme via sequence of generic steps include: removing role helper; incorporating variety optimizations (using e.g., Merkle trees); applying Fiat–Shamir transformation. resulting EUF-CMA secure in QROM, following advantages: (a) Security relies on only minimal assumptions backed by long-studied NP-complete problem; (b) trusted setup structure allows obtaining an arbitrarily small soundness error. minimizes required number repetitions, thus alleviating major bottleneck associated schemes. outline initial performance estimation confirm our competitive respect existing solutions similar type.